On the Permanent of Certain Circulant Matrices

نویسندگان

  • Bruno Codenotti
  • Giovanni Resta
چکیده

In this paper we rst review the basic computational properties of per-manents, and then address some problems concerning permanents of (0; 1) circulant matrices. In particular we analyze their role at the boundary between computational tractability and intractability, showing that (i) a generic circulant matrix contains large arbitrary submatrices, a fact which casts some doubt on the tractability of its permanent; (ii) a very sparse circulant has special properties which can be exploited to eeciently compute its permanent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation of the q-th roots of circulant matrices

In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.

متن کامل

An algorithm for the permanent of circulant matrices

The permanent of an n x n matrix A = (a;j) is the matrix function ( 1) per A = ∑ al1r(1)••• a .. ",( .. )".C~" where the summation is over all permutations in the symmetric group, S ... An n x n matrix A is a circulant if there are scalars ab ... ,a,. such that (2) A= ∑ a;pi-l where P is the n x n permutation matrix corresponding to the cycle (12• .. n) in s". In general the computation of the ...

متن کامل

On higher rank numerical hulls of normal matrices

‎In this paper‎, ‎some algebraic and geometrical properties of the rank$-k$ numerical hulls of normal matrices are investigated‎. ‎A characterization of normal matrices whose rank$-1$ numerical hulls are equal to their numerical range is given‎. ‎Moreover‎, ‎using the extreme points of the numerical range‎, ‎the higher rank numerical hulls of matrices of the form $A_1 oplus i A_2$‎, ‎where $A_1...

متن کامل

Permanents of Circulants: a Transfer Matrix Approach∗ (Extended Abstract)

Calculating the permanent of a (0, 1) matrix is a #P complete problem but there are some classes of structured matrices for which the permanent is calculable in polynomial time. The most well-known example is the fixed-jump (0, 1) circulant matrix which, using algebraic techniques, was shown by Minc to satisfy a constantcoefficient fixed-order recurrence relation. In this note we show how, by i...

متن کامل

A NOTE ON CERTAIN MATRICES WITH h(x)-FIBONACCI POLYNOMIALS

In this paper, it is considered a g-circulant, right circulant, left circulant and a special kind of tridiagonal matrices whose entries are h(x)-Fibonacci polynomials. The determinant of these matrices is established and with the tridiagonal matrices we show that the determinant is equal to the nth term of the h(x)-Fibonacci polynomials.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001